منابع مشابه
Kolmogorov complexity and the second incompleteness theorem
We shall prove the second incompleteness theorem via Kolmogorov complexity.
متن کاملChapter 19 Kolmogorov Complexity
Kolmogorov complexity has intellectual roots in the areas of information theory, computability theory and probability theory. Despites its remarkably simple basis, it has some striking applications in Complexity Theory. The subject was developed by the Russian mathematician Andrei N. Kolmogorov (1903–1987) as an approach to the notion of random sequences and to provide an algorithmic approach t...
متن کاملCompressibility and Kolmogorov Complexity
We continue the investigation of the path-connected geometry on the Cantor space and the related notions of dilution and compressibility described in [1]. These ideas are closely related to the notions of effective Hausdorff and packing dimensions of reals, and we argue that this geometry provides the natural context in which to study them. In particular we show that every regular real can be m...
متن کاملKolmogorov Complexity: a survey
What follows is a survey of the field of Kolmogorov complexity. Kolmogorov complexity, named after the mathematician Andrej Nikolaevič Kolmogorov, is a measure of the algorithmic complexity of a certain object (represented as a string of symbols) in terms of how hard it is to describe it. This measure dispenses with the need to know the probability distribution that rules a certain object (in g...
متن کاملKolmogorov Complexity with Error
We introduce the study of Kolmogorov complexity with error. For a metric d, we define Ca(x) to be the length of a shortest program p which prints a string y such that d(x, y) ≤ a. We also study a conditional version of this measure Ca,b(x|y) where the task is, given a string y′ such that d(y, y′) ≤ b, print a string x′ such that d(x, x′) ≤ a. This definition admits both a uniform measure, where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2008
ISSN: 0219-7499,1793-6918
DOI: 10.1142/s021974990800375x